Separating bounded arithmetic theories with short length induction
نویسنده
چکیده
We de ne a hierarchy of bounded arithmetic L i 2 for i 1 which are modi cations of TAC of Clote and Takeuti. Provably total functions of L i 2 are characterized in terms of circuit complexity. As a consequence non-conservation results are obtained for L i 2 and L i+2 2 by applying a lower bound for st-connectivity. A weaker non-conservation result is also obtained betweenAC 0 CA and L i 2 using the KPT witnessing theorem.
منابع مشابه
Cuts and overspill properties in models of bounded arithmetic
In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...
متن کاملProposal : Bounded Arithmetic for Small Complexity Classes by Phuong Nguyen A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy
Thesis Proposal: Bounded Arithmetic for Small Complexity Classes Phuong Nguyen Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2007 First we provide a unified framework for developing theories of Bounded Arithmetic that are associated with uniform classes inside polytime (P) in the same way that Buss’s theory S2 is associated with P. We obtain finitely axiomat...
متن کاملDynamic ordinal analysis
Dynamic ordinal analysis is ordinal analysis for weak arithmetics like fragments of bounded arithmetic. In this paper we will define dynamic ordinals – they will be sets of number theoretic functions measuring the amount of sΠb1(X) order induction available in a theory. We will compare order induction to successor induction over weak theories. We will compute dynamic ordinals of the bounded ari...
متن کاملBounded Reverse Mathematics by Phuong Nguyen
Bounded Reverse Mathematics Phuong Nguyen Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 First we provide a unified framework for developing theories of Bounded Arithmetic that are associated with uniform classes inside polytime (P) in the same way that Buss’s theory S2 is associated with P. We obtain finitely axiomatized theories many of which turn out ...
متن کاملProofs, Programs and Abstract Complexity
Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being first order Peano arithmetic. Foundational questions asked about axiom systems comprise analysing their provable consequences, describing their class of provable recursive functions (i.e. for which programs can termination be proven from the axioms), and characterising their consistency strength. One b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007